منابع مشابه
Characterizing Behavioural Semantics and Abstractor Semantics
In the literature one can distinguish two main approaches to the definition of observational semantics of algebraic specifications. On one hand, observational semantics is defined using a notion of observational satisfaction for the axioms of a specification and on the other hand one can define observational semantics of a specification by abstraction with respect to an observational equivalenc...
متن کاملBehavioural specifications'
For historic reasons, programming (and its theory, as well as methodology) evolved from the computing paradigm. Many computer applications in common use do not fit this paradigm well. Neither an operating system, nor a word processor compute anything, even if their operation involves many computations. Here we follow another paradigm, viz. that of system behaviour, in which finite actions are u...
متن کاملFoundations for structuring behavioural specifications
We develop foundations for structuring behavioural specifications based on the logic tradition of hidden algebra. This includes an analysis of a number of important technical compositional properties for behavioural signatures, such as pushouts, inclusions and unions, as well as an investigation of algebraic rules for behavioural module composition. As a particularity of behavioural specificati...
متن کاملHybridSAL Relational Abstractor: A New Abstractor for Hybrid Systems
Assume we are given the initial condition x = 1, y = 2 and the invariant that y is always non-negative. We wish to prove that x always remains non-negative. This example can be encoded in HybridSAL as shown in Figure 1. The HybridSAL syntax is almost identical to the syntax of SAL [2], but for a few modifications that enable encoding of continuous dynamical systems. The key changes in HybridSAL...
متن کاملVerifying Behavioural Specifications in CafeOBJ Environment
In this paper, we present techniques for automated verification of behavioural specifications using hidden algebra. Two non-trivial examples, the Alternating Bit Protocol and a snooping cache coherence protocol, are presented with complete specification code and proof scores for CafeOBJ verification system. The refinement proof based on behavioural coinduction is given for the first example, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1995
ISSN: 0167-6423
DOI: 10.1016/0167-6423(95)00014-3